Low power, compact charge coupled device signal processing system

A variety of charged coupled devices (CCDs) for performing programmable correlation for preprocessing environmental sensor data preparatory to its transmission to the ground were developed. A total of two separate ICs were developed and a third was evaluated. The first IC was a CCD chirp z transform IC capable of performing a 32 point DFT at frequencies to 1 MHz. All on chip circuitry operated as designed with the exception of the limited dynamic range caused by a fixed pattern noise due to interactions between the digital and analog circuits. The second IC developed was a 64 stage CCD analog/analog correlator for performing time domain correlation. Multiplier errors were found to be less than 1 percent at designed signal levels and less than 0.3 percent at the measured smaller levels. A prototype IC for performing time domain correlation was also evaluated

Towards Verifying Nonlinear Integer Arithmetic

We eliminate a key roadblock to efficient verification of nonlinear integer arithmetic using CDCL SAT solvers, by showing how to construct short resolution proofs for many properties of the most widely used multiplier circuits. Such short proofs were conjectured not to exist. More precisely, we give n^{O(1)} size regular resolution proofs for arbitrary degree 2 identities on array, diagonal, and Booth multipliers and quasipolynomial- n^{O(\log n)} size proofs for these identities on Wallace tree multipliers.Comment: Expanded and simplified with improved result

Inverse semigroup actions as groupoid actions

To an inverse semigroup, we associate an \'etale groupoid such that its actions on topological spaces are equivalent to actions of the inverse semigroup. Both the object and the arrow space of this groupoid are non-Hausdorff. We show that this construction provides an adjoint functor to the functor that maps a groupoid to its inverse semigroup of bisections, where we turn \'etale groupoids into a category using algebraic morphisms. We also discuss how to recover a groupoid from this inverse semigroup.Comment: Corrected a typo in Lemma 2.14 in the published versio

Effects of cochlear implantation on binaural hearing in adults with unilateral hearing loss

A FDA clinical trial was carried out to evaluate the potential benefit of cochlear implant (CI) use for adults with unilateral moderate-to-profound sensorineural hearing loss. Subjects were 20 adults with moderate-to-profound unilateral sensorineural hearing loss and normal or near-normal hearing on the other side. A MED-EL standard electrode was implanted in the impaired ear. Outcome measures included: (a) sound localization on the horizontal plane (11 positions, −90° to 90°), (b) word recognition in quiet with the CI alone, and (c) masked sentence recognition with the target at 0° and the masker at −90°, 0°, or 90°. This battery was completed preoperatively and at 1, 3, 6, 9, and 12 months after CI activation. Normative data were also collected for 20 age-matched control subjects with normal or near-normal hearing bilaterally. The CI improved localization accuracy and reduced side bias. Word recognition with the CI alone was similar to performance of traditional CI recipients. The CI improved masked sentence recognition when the masker was presented from the front or from the side of normal or near-normal hearing. The binaural benefits observed with the CI increased between the 1- and 3-month intervals but appeared stable thereafter. In contrast to previous reports on localization and speech perception in patients with unilateral sensorineural hearing loss, CI benefits were consistently observed across individual subjects, and performance was at asymptote by the 3-month test interval. Cochlear implant settings, consistent CI use, and short duration of deafness could play a role in this result

Good Mates Retain Us Right: Investigating the Relationship between Mate Retention Strategies, Mate Value and Relationship Satisfaction

Mate retention strategies are an important tool in keeping a partner, and their use is determined by the mate value (MV) of the partner one is trying to keep. The type of strategy used is also dependent on one’s own MV: mates of lower MV are more prone to exhibiting strategies that are cost-inflicting for their partners, whereas partner-benefiting strategies are used by mates of higher value. The type of strategies used affects relationship satisfaction (RS), and is also affected by the perceived difference in MVs. However, it is unclear how someone’s perception of their partner’s MV is related to that partner’s behavior and their own RS. To this aim, we investigated the relationship between these variables on a sample of 178 couples. Our results showed that benefit-inducing strategies were used more by—and towards—partners of higher MV, and were positively connected with RS. Cost-inflicting strategies were more used by—and towards—partners of lower MV, and were negatively connected with RS. Less MV difference was positively correlated with RS and benefiting strategies, and negatively correlated with cost-inflicting strategies. It seems that good mates use strategies that benefit their partners, which, in turn, make them more valuable and, consequently, their partner more satisfied

Parameterized bounded-depth Frege is not optimal

A general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [9]. There the authors concentrate on tree-like Parameterized Resolution-a parameterized version of classical Resolution-and their gap complexity theorem implies lower bounds for that system. The main result of the present paper significantly improves upon this by showing optimal lower bounds for a parameterized version of bounded-depth Frege. More precisely, we prove that the pigeonhole principle requires proofs of size n in parameterized bounded-depth Frege, and, as a special case, in dag-like Parameterized Resolution. This answers an open question posed in [9]. In the opposite direction, we interpret a well-known technique for FPT algorithms as a DPLL procedure for Parameterized Resolution. Its generalization leads to a proof search algorithm for Parameterized Resolution that in particular shows that tree-like Parameterized Resolution allows short refutations of all parameterized contradictions given as bounded-width CNF's

On Tackling the Limits of Resolution in SAT Solving

The practical success of Boolean Satisfiability (SAT) solvers stems from the CDCL (Conflict-Driven Clause Learning) approach to SAT solving. However, from a propositional proof complexity perspective, CDCL is no more powerful than the resolution proof system, for which many hard examples exist. This paper proposes a new problem transformation, which enables reducing the decision problem for formulas in conjunctive normal form (CNF) to the problem of solving maximum satisfiability over Horn formulas. Given the new transformation, the paper proves a polynomial bound on the number of MaxSAT resolution steps for pigeonhole formulas. This result is in clear contrast with earlier results on the length of proofs of MaxSAT resolution for pigeonhole formulas. The paper also establishes the same polynomial bound in the case of modern core-guided MaxSAT solvers. Experimental results, obtained on CNF formulas known to be hard for CDCL SAT solvers, show that these can be efficiently solved with modern MaxSAT solvers